Implementing Kearns-Vazirani Algorithm for Learning DFA Only with Membership Queries
نویسنده
چکیده
Two algorithms for learning dfa with membership queries are described. Both of them are based on Kearns and Vazirani’s version of Angluin’s L∗. Our algorithms tied in the third place in the Zulu competition.
منابع مشابه
An Abstract Framework for Counterexample Analysis in Active Automata Learning
Counterexample analysis has emerged as one of the key challenges in Angluin-style active automata learning. Rivest and Schapire (1993) showed for the L∗ algorithm that a single suffix of the counterexample was sufficient to ensure progress. This suffix can be obtained in a binary search fashion, requiring Θ(logm) membership queries for a counterexample of length m. Correctly implementing this a...
متن کاملOn The Power of Membership Queries in Agnostic Learning On The Power of Membership Queries in Agnostic Learning∗
We study the properties of the agnostic learning framework of Haussler (1992) and Kearns, Schapire, and Sellie (1994). In particular, we address the question: is there any situation in which membership queries are useful in agnostic learning? Our results show that the answer is negative for distribution-independent agnostic learning and positive for agnostic learning with respect to a specific ...
متن کاملOn the Power of Membership Queries in Agnostic Learning
We study the properties of the agnostic learning framework of Haussler [Hau92] and Kearns, Schapire and Sellie [KSS94]. In particular, we address the question: is there any situation in which membership queries are useful in agnostic learning? Our results show that the answer is negative for distribution-independent agnostic learning and positive for agnostic learning with respect to a specific...
متن کاملA Polynominal Time Incremental Algorithm for Learning DFA
We present an efficient incremental algorithm for learning deterministic finite state automata (DFA) from labeled examples and membership queries. This algorithm is an extension of Angluin’s ID procedure to an incremental framework. The learning algorithm is intermittently provided with labeled examples and has access to a knowledgeable teacher capable of answering membership queries. The learn...
متن کاملA Polynomial Time Incremental Algorithm for Learning DFA
We present an e cient incremental algorithm for learning deterministic nite state automata DFA from labeled examples and membership queries This algorithm is an extension of Angluin s ID pro cedure to an incremental framework The learning algorithm is inter mittently provided with labeled examples and has access to a knowl edgeable teacher capable of answering membership queries The learner con...
متن کامل